Piercing Axis-Parallel Boxes
نویسندگان
چکیده
منابع مشابه
Piercing Axis-parallel Boxes
Given a finite family F of axis-parallel boxes in R such that F contains no k + 1 pairwise disjoint boxes, and such that for each two intersecting boxes in F a corner of one box is contained in the other box, we prove that F can be pierced by at most ck log log(k) points, where c is a constant depending only on d. We further show that in some special cases the upper bound on the number of pierc...
متن کاملA Danzer set for Axis Parallel Boxes
We present concrete constructions of discrete sets in R (d ≥ 2) that intersect every aligned box of volume 1 in R, and which have optimal growth rate O(T ).
متن کاملOn Piercing Sets of Axis-Parallel Rectangles and Rings
We consider the p-piercing problem for axis-parallel rectangles. We are given a collection of axis-parallel rectangles in the plane, and wish to determine whether there exists a set of p points whose union intersects all the given rectangles. We present eecient algorithms for nding a piercing set (i.e., a set of p points as above) for values of p = 1; 2; 3; 4; 5. The result for 4 and 5-piercing...
متن کاملOn Piercing (Pseudo)Lines and Boxes
We say a family of geometric objects C has (l, k)-property if every subfamily C ′ ⊆ C of cardinality at most l is kpiercable. In this paper we investigate the existence of g(k, d) such that if any family of objects C in R has the (g(k, d), k)-property, then C is k-piercable. Danzer and Grünbaum showed that g(k, d) is infinite for families of boxes and translates of centrally symmetric convex he...
متن کاملCovering a set of points by two axis-parallel boxes
In this paper we consider the following covering problem. Given a set S of n points in d-dimensional space, d 2, nd two axis-parallel boxes that together cover the set S such that the measure of the largest box is minimized, where the measure is a monotone function of the box. We present a simple algorithm for nding boxes in O(n log n + n d?1) time and O(n) space.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/7034